Positive univariate trace polynomials
نویسندگان
چکیده
A univariate trace polynomial is a in variable x and formal symbols Tr ( j ) . Such an expression can be naturally evaluated on matrices, where the are as normalized traces. This paper addresses global constrained positivity of polynomials symmetric matrices all finite sizes. tracial analog Artin's solution to Hilbert's 17th problem given: positive semidefinite quotient sums products squares traces polynomials.
منابع مشابه
Zero sets of univariate polynomials
Let L be the zero set of a nonconstant monic polynomial with complex coe¢ cients. In the context of constructive mathematics without countable choice, it may not be possible to construct an element of L. In this paper we introduce a notion of distance from a point to a subset, more general than the usual one, that allows us to measure distances to subsets like L. To verify the correctness of th...
متن کاملZeros of univariate interval polynomials
Polynomials with perturbed coefficients, which can be regarded as interval polynomials, are very common in the area of scientific computing due to floating point operations in a computer environment. In this paper, the zeros of interval polynomials are investigated. We show that, for a degree n interval polynomial, the number of interval zeros is at most n and the number of complex block zeros ...
متن کاملApproximate Gcd of Inexact Univariate Polynomials
− The problem of finding the greatest common divisor (GCD) of univariate polynomials appears in many engineering fields. Despite its formulation is well-known, it is an ill-posed problem that entails numerous difficulties when the coefficients of the polynomials are not known with total accuracy, as, for example, when they come from measurement data. In this work we propose a novel GCD estimati...
متن کاملOn the S-Lemma for Univariate Polynomials
The so-called S-lemma has played an important role in optimization, both in theory and in applications. The significance of S-lemma is especially pronounced in control theory, robust optimization, and non-convex quadratic optimization. Hitherto, S-lemma is however established only in the domain of quadratic functions. In this paper we shall extend the notion of S-lemma to the class of univariat...
متن کاملThe Number of Decomposable Univariate Polynomials
A univariate polynomial f over a field is decomposable if it is the composition f = g ◦h of two polynomials g and h whose degree is at least 2. We determine an approximation to the number of decomposable polynomials over a finite field. The tame case, where the field characteristic p does not divide the degree n of f , is reasonably well understood, and we obtain exponentially decreasing error ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2021
ISSN: ['1090-266X', '0021-8693']
DOI: https://doi.org/10.1016/j.jalgebra.2021.03.027